PCP theorem - PDFSEARCH.IO - Document Search Engine

PCP theorem
Results: 14

#	Item
1	Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem∗ Irit Dinur† Omer Reingold Add to Reading List Source URL: omereingold.files.wordpress.com Language: English - Date: 2014-10-22 02:04:47
2	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2008-02-01 14:51:28 Computational complexity theory Theory of computation Complexity classes NP-complete problems Mathematical optimization NP-hard problems MAX-3SAT NP Approximation algorithm Probabilistically checkable proof PCP theorem APX
3	2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg Add to Reading List Source URL: www.sigact.org Language: English - Date: 2015-05-26 18:25:25 Probabilistic complexity theory Theoretical computer science Morphisms Computational complexity theory PCP theorem Mathematical optimization Probabilistically checkable proof Combinatorica IP Algorithm Russell Impagliazzo Graph isomorphism
4	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2006-04-11 06:21:40 NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory
5	The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MIT Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-04-12 18:03:28 Probabilistic complexity theory Complexity classes Mathematical optimization Probabilistically checkable proof PCP theorem NP NEXPTIME Hardness of approximation P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
6	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 NP-complete problems Probabilistic complexity theory Mathematical optimization Complexity classes PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
7	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 09:39:33 Computational complexity theory NP-complete problems Probabilistic complexity theory PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof NP Clique Theoretical computer science Applied mathematics Mathematics
8	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 Probabilistic complexity theory Structural complexity theory NP-complete problems Approximation algorithms 2-satisfiability L-reduction Reduction PCP theorem Probabilistically checkable proof Theoretical computer science Applied mathematics Computational complexity theory
9	TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2006-02-09 12:47:04 Complexity classes NP-complete problems Operations research Approximation algorithms Travelling salesman problem Combinatorial optimization APX Optimization problem PCP theorem Theoretical computer science Computational complexity theory Applied mathematics
10	On Approximation Lower Bounds for TSP with Bounded Metrics Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-02-27 08:46:45 Complexity classes NP-complete problems Operations research Travelling salesman problem Approximation algorithm Optimization problem PCP theorem NP-complete APX Theoretical computer science Computational complexity theory Applied mathematics

UPDATE